On the stable b-matching polytope

We characterize the bipartite stable b-matching polytope in terms of linear constraints. The stable b-matching polytope is the convex hull of the characteristic vectors of stable b-matchings, that is, of stable assignments of a two-sided multiple partner matching model. Our proof uses the comparability theorem of Roth and Sotomayor [13] and follows a similar line as Rothblum did in [14] for the stable matching polytope.